- recursively presented
- рекурсивно определённый; рекурсивно представленный
English-Russian scientific dictionary. 2008.
recursively presented
Смотреть что такое "recursively presented" в других словарях:
Recursively enumerable language — In mathematics, logic and computer science, a recursively enumerable language is a type of formal language which is also called partially decidable or Turing acceptable. It is known as a type 0 language in the Chomsky hierarchy of formal… … Wikipedia
Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… … Wikipedia
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
Presentation of a group — In mathematics, one method of defining a group is by a presentation. One specifies a set S of generators so that every element of the group can be written as a product of some of these generators, and a set R of relations among those generators.… … Wikipedia
Higman's embedding theorem — In group theory, Higman s embedding theorem states that every finitely generated recursively presented group R can be embedded as a subgroup of some finitely presented group G . This is a result of Graham Higman from the 1960s. [ Graham Higman,… … Wikipedia
HNN extension — In mathematics, the HNN extension is a basic construction of combinatorial group theory.Introduced in a 1949 paper Embedding Theorems for Groups [ cite journal|title=Embedding Theorems for Groups|journal=Jornal of the London Mathematical… … Wikipedia
Algebraically closed group — In mathematics, in the realm of group theory, a group A is algebraically closed if any finite set of equations and inequations that make sense in A already have a solution in A . This idea will be made precise later in the article.Informal… … Wikipedia
Absolute presentation of a group — In mathematics, one method of defining a group is by an absolute presentation.B. Neumann, The isomorphism problem for algebraically closed groups, in: Word Problems, Decision Problems, and the Burnside Problem in Group Theory, Amsterdam London… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium
